k-Anonymity Location Privacy Algorithm Based on Clustering

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Clustering Based K-anonymity Algorithm for Privacy Preservation

K-anonymity is an effective model for protecting privacy while publishing data, which can be implemented by different ways. Among them, local generalization are popular because of its low information loss. But such algorithms are generally computation expensive making it difficult to perform well in the case of large amount of data. In order to solve this problem, this paper proposes a clusteri...

متن کامل

A Clustering K-Anonymity Scheme for Location Privacy Preservation

The continuous advances in sensing and positioning technologies have resulted in a dramatic increase in popularity of LocationBased Services (LBS). Nevertheless, the LBS can lead to user privacy breach due to sharing location information with potentially malicious services. A high degree of location privacy preservation for LBS is extremely required. In this paper, a clustering K-anonymity sche...

متن کامل

K-Anonymity Algorithm Using Encryption for Location Privacy Protection

In this paper, we solved a location privacy protection in location-based services (LBS) where the mobile user had to report her exact location information to an LBS provider for the purpose of obtaining her wished services. Location invisible had been well proposed and researched to defend user privacy. However, as the nature of the insecure wireless net environment the user’s location informat...

متن کامل

A K-Anonymity Based Schema for Location Privacy Preservation

In recent years, with the development of mobile devices, the location based services (LBSs) have become more and more prevailing and most applications installed on these devices call for location information. Yet, the untrusted LBS provider can collect these location information, which may potentially threaten users’ location privacy. In view of this challenge, we propose a two-tier schema for ...

متن کامل

Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm

Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2018

ISSN: 2169-3536

DOI: 10.1109/access.2017.2780111